A Simpler Proof of the Existence of Quantum Weak Coin Flipping with Arbitrarily Small Bias
نویسندگان
چکیده
God does not play dice. He flips coins instead.” And though for some reason He has denied us quantum bit commitment. And though for some reason he has even denied us strong coin flipping. He has, in His infinite mercy, granted us quantum weak coin flipping so that we too may flip coins. Instructions for the flipping of coins are contained herein. But be warned! Only those who have mastered Kitaev’s formalism relating coin flipping and operator monotone functions may succeed. For those foolhardy enough to even try, a complete tutorial is included.
منابع مشابه
Serial composition of quantum coin flipping and bounds on cheat detection for bit commitment
Quantum protocols for coin flipping can be composed in series in such a way that a cheating party gains no extra advantage from using entanglement between different rounds. This composition principle applies to coin-flipping protocols with cheat sensitivity as well, and is used to derive two results: There are no quantum strong coin-flipping protocols with cheat sensitivity that is linear in th...
متن کاملQuantum coin flipping with arbitrary small bias is impossible
Lo and Chau [7] showed that ideal quantum coin flipping protocol is impossible. The proof was simply derived from the impossibility proof of quantum bit commitment [7, 8]. However, the proof still leaves the possibility of quantum coin flipping protocol with arbitrary small bias. In this paper, we show that quantum coin flipping protocol with arbitrary small bias is impossible and show the lowe...
متن کاملWeak coin flipping with small bias
This paper presents a quantum protocol that demonstrates that weak coin flipping with bias ≈ 0.239, less than 1/4, is possible. A bias of 1/4 was the smallest known, and followed from the strong coin flipping protocol of Ambainis in [33rd STOC, 2001] (also proposed by Spekkens and Rudolph [Phys. Rev. A 65 (2002) 012310]). Protocols with yet smaller bias ≈ 0.207 have independently been discovere...
متن کاملLarge family of quantum weak coin-flipping protocols
Each classical public-coin protocol for coin flipping is naturally associated with a quantum protocol for weak coin flipping. The quantum protocol is obtained by replacing classical randomness with quantum entanglement and by adding a cheat detection test in the last round that verifies the integrity of this entanglement. The set of such protocols defines a family which contains the protocol wi...
متن کاملQuantum dice rolling: a multi-outcome generalization of quantum coin flipping
The problem of quantum dice rolling (DR)—a generalization of the problem of quantum coin flipping (CF) to more than two outcomes and parties— is studied in both its weak and strong variants. We prove by construction that quantum mechanics allows for (i) weak N -sided DR admitting arbitrarily small bias for any N and (ii) two-party strong N -sided DR saturating Kitaev’s bound for any N . To deri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 45 شماره
صفحات -
تاریخ انتشار 2016